#pragma GCC optimize(2)
#include <iostream>
#include <algorithm>
#include <cstring>
#include <string>
#include <map>
#include <vector>

using namespace std;
using LL = long long;

/*
we can find that treasure position (x, y) is (sum(x, y) + sum(ax, ay)) / n
*/

int main(){
    freopen("in.txt", "r", stdin);
    freopen("out.txt", "w", stdout);
    ios::sync_with_stdio(false);
    cin.tie(nullptr);

    int n;
    LL sumx = 0, sumy = 0;
    cin >> n;
    for(int i = 1; i <= n * 2; i ++){
        LL x, y;
        cin >> x >> y;
        sumx += x;
        sumy += y;
    }

    sumx /= n;
    sumy /= n;
    cout << sumx << " " << sumy << '\n';


    return 0;
}